A General Approximation Technique for Constrained Forest Problems
نویسندگان
چکیده
منابع مشابه
When cycles collapse: A general approximation technique for constrained two-connectivity problems
We present a general approximation technique for a class of network design problems where we seek a network of minimum cost that satisses certain communication requirements and is resilient to worst-case single-link failures. Our algorithm runs in O(n 2 log n) time on a graph with n nodes and outputs a solution of cost at most thrice the optimum. We extend our technique to obtain approximation ...
متن کاملApproximation Algorithms for Constrained Knapsack Problems
We study constrained versions of the knapsack problem in which dependencies between items are given by a graph. In one version, an item can be selected only if one of its neighbours is also selected. In the other version, an item can be selected only when all its neighbours are also selected. These problems generalize and unify several problems including the prize collecting and budgeted maximu...
متن کاملApproximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
A well studied and diicult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider precedence delays, associating with each precedence constraint a certain amount of time which must elapse between the completion and start times of the corresponding jobs. Release dates, among others, may be modeled in this fashi...
متن کاملA Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کاملChance-Constrained Programming Models and Approximation Algorithms for General Stochastic Bottleneck Spanning Tree Problems
This paper considers a balance-constrained stochastic bottleneck spanning tree problem (BCSBSTP) in which edge weights are independently distributed but may follow arbitrary random distributions. The problem minimizes a scalar and seeks a spanning tree, of which the maximum edge weight is bounded by the scalar for a given certain probability, and meanwhile the minimum edge weight is lower bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1995
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539793242618